Hybrid Circuit for Stimulated Bone Regrowth
نویسندگان
چکیده
منابع مشابه
Bone regrowth after surgical decompression for lumbar spinal stenosis.
We reviewed 40 patients treated surgically for lumbar stenosis at an average time of 8.6 years after operation. In 32, total laminectomy had been performed and in eight bilateral laminotomy, both at one or more levels. Of the 16 patients with degenerative spondylolisthesis, ten had had a concomitant spinal fusion. Patients were assigned to one of four groups according to the amount of bone regr...
متن کاملCircuit Models for the Hybrid Element Method
In this paper, we describe a new hybrid method which combines the boundary element method (BEM) and the nite element method (FEM) to calculate the circuit models for layout dependent capacitances in VLSI circuits. The hybrid method which we present does more than solving a particular eld problem, it produces a good physical circuit model for the interface between the regions where the BEM and t...
متن کاملEfficient Hybrid Search Techniques For Circuit Partitioning
– Recently, four search approaches have emerged for handling complex combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search and Greedy Randomized Search Procedure (GRASP). Based on simple ideas, these heuristics have been extremely efficient in finding near-optimal or optimal solutions for many types of difficult problems [1]. In this paper we apply these appr...
متن کاملA Hybrid Genetic Approach for Circuit Bipartitioning
We propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local optimization heuristic which is a modification of Fiduccia-Matheyses algorithm. Using well-known benchmarks (including ACM/SIGDA benchmarks), the combination of genetic algorithm and the local heuristic performed better than hMetis, a represent...
متن کاملA Hybrid Genetic Search For Circuit Bipartitioning
The Fiduccia-Matheyses algorithm (FM) [1] is a representative iterative improvement algorithm for a hypergraph partitioning problem. But the quality of the FM is not stable. Kim and Moon [3] introduced lock gain as a primary measure for choosing the nodes to move. It uses the history of search more eÆciently. Lock gain showed excellent performance for general graphs. We adapt the lock gain for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ElectroComponent Science and Technology
سال: 1983
ISSN: 0305-3091
DOI: 10.1155/apec.10.67